A GraphML-based Visualization Framework for Workflow-Performers' Closeness Centrality Measurements
نویسندگان
چکیده
A hot-issued research topic in the workflow intelligence arena is the emerging topic of “workflow-supported organizational social networks.” These specialized social networks have been proposed to primarily represent the process-driven work-sharing and work-collaborating relationships among the workflow-performers fulfilling a series of workflow-related operations in a workflow-supported organization. We can discover those organizational social networks, and visualize its analysis results as organizational knowledge. In this paper, we are particularly interested in how to visualize the degrees of closeness centralities among workflow-performers by proposing a graphical representation schema based on the Graph Markup Language, which is named to ccWSSN-GraphML. Additionally, we expatiate on the functional expansion of the closeness centralization formulas so as for the visualization framework to handle a group of workflow procedures (or a workflow package) with organizational workflow-performers.
منابع مشابه
A Theoretical Framework for Closeness Centralization Measurements in a Workflow-Supported Organization
In this paper, we build a theoretical framework for quantitatively measuring and graphically representing the degrees of closeness centralization among performers assigned to enact a workflow procedure. The degree of closeness centralization of a workflow-performer reflects how near the performer is to the other performers in enacting a corresponding workflow model designed for workflow-support...
متن کاملAn Estimated Closeness Centrality Ranking Algorithm and Its Performance Analysis in Large-Scale Workflow-supported Social Networks
This paper implements an estimated ranking algorithm of closeness centrality measures in large-scale workflow-supported social networks. The traditional ranking algorithms for large-scale networks have suffered from the time complexity problem. The larger the network size is, the bigger dramatically the computation time becomes. To solve the problem on calculating ranks of closeness centrality ...
متن کاملA Stochastic Workflow Performer-To-Activity Affiliation Network Model (BMFSA2015)
This paper proposes a formal concept of stochastic workflow activity-to-performer affiliation network model. The proposed model is based upon the conceptual formalism of an extended information control net [20] that is revised from the original so as to adopt the probability theory to the activity-to-performer bindings in specifying a workflow procedure. In general, when a workflow management e...
متن کاملDANCE: A Framework for the Distributed Assessment of Network Centralities
We propose a method for the Distributed Assessment of Network CEntrality (DANCE) in complex networks. DANCE attributes to each node a volume-based centrality computed using only localized information, thus not requiring knowledge of the full network topology. We show DANCE is simple, yet efficient, in assessing node centrality in a distributed way. Our proposal also provides a way for locating ...
متن کاملEfficient Computation of Semivalues for Game-Theoretic Network Centrality
Solution concepts from cooperative game theory, such as the Shapley value or the Banzhaf index, have recently been advocated as interesting extensions of standard measures of node centrality in networks. While this direction of research is promising, the computation of game-theoretic centrality can be challenging. In an attempt to address the computational issues of game-theoretic network centr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- TIIS
دوره 9 شماره
صفحات -
تاریخ انتشار 2015